Moreover , based on in - depth research of " the existing scan - line polygon fill algorithm , the author has introduced a new fast method for clipping arbitrary boundary areas algorithm which uses the edge consistency and the scan - line consistency and adopts sorted chain table , i t can reduce the quantity of calculating intersection points and improve the efficiency of algorithm 另外,作者在對(duì)已有的掃描線填充算法深入研究的基礎(chǔ)上,介紹一種利用裁剪區(qū)域的邊的連貫性和掃描線的連貫性,從而減少求交計(jì)算量、提高算法效率的有序鏈表的快速裁剪算法。